Learning to discriminate between ligand-bound and disulfide-bound cysteines
نویسندگان
چکیده
منابع مشابه
Learning to discriminate between ligand-bound and disulfide-bound cysteines.
We present a machine learning method to discriminate between cysteines involved in ligand binding and cysteines forming disulfide bridges. Our method uses a window of multiple alignment profiles to represent each instance and support vector machines with a polynomial kernel as the learning algorithm. We also report results obtained with two new kernel functions based on similarity matrices. Exp...
متن کاملImproving disulfide connectivity prediction with sequential distance between oxidized cysteines
SUMMARY Predicting disulfide connectivity precisely helps towards the solution of protein structure prediction. In this study, a descriptor derived from the sequential distance between oxidized cysteines (denoted as DOC) is proposed. An approach using support vector machine (SVM) method based on weighted graph matching was further developed to predict the disulfide connectivity pattern in prote...
متن کاملIntramolecular disulfide bond between catalytic cysteines in an intein precursor.
Protein splicing is a self-catalyzed and spontaneous post-translational process in which inteins excise themselves out of precursor proteins while the exteins are ligated together. We report the first discovery of an intramolecular disulfide bond between the two active-site cysteines, Cys1 and Cys+1, in an intein precursor composed of the hyperthermophilic Pyrococcus abyssi PolII intein and e...
متن کاملSingle Array and Bound Method (RESEARCH NOTE).
One of the major disadvantages of using Branch and Bound algorithm to solve permutation bases problems by computer is the size of main memory required. The single Array Branch and Bound (SABB) method introduction here aims to overcome this deficiency, using only N memory locations as a vector of size N, and a single cell C with N bits.
متن کاملA bound for Feichtinger conjecture
In this paper, using the discrete Fourier transform in the finite-dimensional Hilbert space C^n, a class of nonRieszable equal norm tight frames is introduced and using this class, a bound for Fiechtinger Conjecture is presented. By the Fiechtinger Conjecture that has been proved recently, for given A,C>0 there exists a universal constant delta>0 independent of $n$ such that every C-equal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Protein Engineering Design and Selection
سال: 2004
ISSN: 1741-0126,1741-0134
DOI: 10.1093/protein/gzh042